package datastructure.array;

/**
 * This is NP complete problem
 * Given an unsorted array, how to divide them into two equal arrays whose difference of sum is minimum
 *
 * http://en.wikipedia.org/wiki/Partition_problem
 *
 * Can be solved using dynamic programming
 *
 *
 * @author Lei Zhang
 */
public class PartitionArrayIntoTwoSubArrayWithDifferenceSumIsMinimum {
}
